منابع مشابه
Poisson Boundaries of Random Walks on Discrete Solvable Groups
Let G be a topological group, and { a probability measure on G. A function f on G is called harmonic if it satisses the mean value property f(g) = Z f(gx) dd(x) for all g 2 G. It is well known that under natural assumptions on the measure there exists a measure G-space ? with a quasi-invariant measure such that the Poisson formula f(g) = h b f; gi states an isometric isomorphism between the Ban...
متن کاملRandom Walks on Finite Groups
Markov chains on finite sets are used in a great variety of situations to approximate, understand and sample from their limit distribution. A familiar example is provided by card shuffling methods. From this viewpoint, one is interested in the “mixing time” of the chain, that is, the time at which the chain gives a good approximation of the limit distribution. A remarkable phenomenon known as t...
متن کاملEmbeddings of discrete groups and the speed of random walks
Let G be a group generated by a finite set S and equipped with the associated left-invariant word metric dG. For a Banach space X let αX(G) (respectively α # X(G)) be the supremum over all α ≥ 0 such that there exists a Lipschitz mapping (respectively an equivariant mapping) f : G → X and c > 0 such that for all x, y ∈ G we have ‖ f (x) − f (y)‖ ≥ c · dG(x, y). In particular, the Hilbert compre...
متن کاملRandom Walks on Discrete and Continuous Circles
We consider a large class of random walks on the discrete circle Z/(n), defined in terms of a piecewise Lipschitz function, and motivated by the “generation gap” process of Diaconis. For such walks, we show that the time until convergence to stationarity is bounded independently of n. Our techniques involve Fourier analysis and a comparison of the random walks on Z/(n) with a random walk on the...
متن کاملRandom Walks on Discrete and Continuous
We consider a large class of random walks on the discrete circle Z=(n), deened in terms of a piecewise Lipschitz function, and motivated by the \generation gap" process of Diaconis. For such walks, we show that the time until convergence to stationarity is bounded independently of n. Our techniques involve Fourier analysis and a comparison of the random walks on Z=(n) with a random walk on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2018
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm6462-11-2016